github.com/klauspost/compress/zstd.tableEntry.offset (field)
98 uses
github.com/klauspost/compress/zstd (current package)
enc_better.go#L75: v := e.table[i].offset
enc_better.go#L81: e.table[i].offset = v
enc_better.go#L175: e.table[nextHashS] = tableEntry{offset: off, val: uint32(cv)}
enc_better.go#L227: e.table[hashLen(cv1, betterShortTableBits, betterShortLen)] = tableEntry{offset: off + 1, val: uint32(cv1)}
enc_better.go#L284: e.table[hashLen(cv1, betterShortTableBits, betterShortLen)] = tableEntry{offset: off + 1, val: uint32(cv1)}
enc_better.go#L349: coffsetS := candidateS.offset - e.cur
enc_better.go#L509: e.table[hashLen(cv1, betterShortTableBits, betterShortLen)] = tableEntry{offset: off + 1, val: uint32(cv1)}
enc_better.go#L536: e.table[nextHashS] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_better.go#L603: v := e.table[i].offset
enc_better.go#L609: e.table[i].offset = v
enc_better.go#L694: e.table[nextHashS] = tableEntry{offset: off, val: uint32(cv)}
enc_better.go#L748: e.table[h1] = tableEntry{offset: off + 1, val: uint32(cv1)}
enc_better.go#L808: e.table[h1] = tableEntry{offset: off + 1, val: uint32(cv1)}
enc_better.go#L874: coffsetS := candidateS.offset - e.cur
enc_better.go#L1027: e.table[h1] = tableEntry{offset: off + 1, val: uint32(cv1)}
enc_better.go#L1056: e.table[nextHashS] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_better.go#L1124: offset: i,
enc_better.go#L1128: offset: i + 1,
enc_better.go#L1132: offset: i + 2,
enc_better.go#L1136: offset: i + 3,
enc_dfast.go#L57: v := e.table[i].offset
enc_dfast.go#L63: e.table[i].offset = v
enc_dfast.go#L66: v := e.longTable[i].offset
enc_dfast.go#L72: e.longTable[i].offset = v
enc_dfast.go#L133: entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_dfast.go#L180: coffsetL := s - (candidateL.offset - e.cur)
enc_dfast.go#L181: coffsetS := s - (candidateS.offset - e.cur)
enc_dfast.go#L188: t = candidateL.offset - e.cur
enc_dfast.go#L209: coffsetL = s - (candidateL.offset - e.cur) + checkAt
enc_dfast.go#L212: e.longTable[nextHashL] = tableEntry{offset: s + checkAt + e.cur, val: uint32(cv)}
enc_dfast.go#L217: t = candidateL.offset - e.cur
enc_dfast.go#L225: t = candidateS.offset - e.cur
enc_dfast.go#L298: te0 := tableEntry{offset: index0 + e.cur, val: uint32(cv0)}
enc_dfast.go#L299: te1 := tableEntry{offset: index1 + e.cur, val: uint32(cv1)}
enc_dfast.go#L304: te0.offset++
enc_dfast.go#L305: te1.offset++
enc_dfast.go#L333: entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_dfast.go#L439: entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_dfast.go#L487: coffsetL := s - (candidateL.offset - e.cur)
enc_dfast.go#L488: coffsetS := s - (candidateS.offset - e.cur)
enc_dfast.go#L495: t = candidateL.offset - e.cur
enc_dfast.go#L516: coffsetL = s - (candidateL.offset - e.cur) + checkAt
enc_dfast.go#L519: e.longTable[nextHashL] = tableEntry{offset: s + checkAt + e.cur, val: uint32(cv)}
enc_dfast.go#L524: t = candidateL.offset - e.cur
enc_dfast.go#L532: t = candidateS.offset - e.cur
enc_dfast.go#L602: te0 := tableEntry{offset: index0 + e.cur, val: uint32(cv0)}
enc_dfast.go#L603: te1 := tableEntry{offset: index1 + e.cur, val: uint32(cv1)}
enc_dfast.go#L608: te0.offset++
enc_dfast.go#L609: te1.offset++
enc_dfast.go#L638: entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_dfast.go#L702: v := e.table[i].offset
enc_dfast.go#L708: e.table[i].offset = v
enc_dfast.go#L711: v := e.longTable[i].offset
enc_dfast.go#L717: e.longTable[i].offset = v
enc_dfast.go#L779: entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_dfast.go#L828: coffsetL := s - (candidateL.offset - e.cur)
enc_dfast.go#L829: coffsetS := s - (candidateS.offset - e.cur)
enc_dfast.go#L836: t = candidateL.offset - e.cur
enc_dfast.go#L857: coffsetL = s - (candidateL.offset - e.cur) + checkAt
enc_dfast.go#L860: e.longTable[nextHashL] = tableEntry{offset: s + checkAt + e.cur, val: uint32(cv)}
enc_dfast.go#L866: t = candidateL.offset - e.cur
enc_dfast.go#L874: t = candidateS.offset - e.cur
enc_dfast.go#L947: te0 := tableEntry{offset: index0 + e.cur, val: uint32(cv0)}
enc_dfast.go#L948: te1 := tableEntry{offset: index1 + e.cur, val: uint32(cv1)}
enc_dfast.go#L957: te0.offset++
enc_dfast.go#L958: te1.offset++
enc_dfast.go#L990: entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_dfast.go#L1060: offset: e.maxMatchOff,
enc_dfast.go#L1067: offset: i,
enc_fast.go#L23: offset int32
enc_fast.go#L57: v := e.table[i].offset
enc_fast.go#L63: e.table[i].offset = v
enc_fast.go#L130: e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_fast.go#L131: e.table[nextHash2] = tableEntry{offset: s + e.cur + 1, val: uint32(cv >> 8)}
enc_fast.go#L172: coffset0 := s - (candidate.offset - e.cur)
enc_fast.go#L173: coffset1 := s - (candidate2.offset - e.cur) + 1
enc_fast.go#L176: t = candidate.offset - e.cur
enc_fast.go#L188: t = candidate2.offset - e.cur
enc_fast.go#L258: e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_fast.go#L367: e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_fast.go#L368: e.table[nextHash2] = tableEntry{offset: s + e.cur + 1, val: uint32(cv >> 8)}
enc_fast.go#L410: coffset0 := s - (candidate.offset - e.cur)
enc_fast.go#L411: coffset1 := s - (candidate2.offset - e.cur) + 1
enc_fast.go#L414: t = candidate.offset - e.cur
enc_fast.go#L422: panic(fmt.Sprintf("t (%d) < 0, candidate.offset: %d, e.cur: %d, coffset0: %d, e.maxMatchOff: %d", t, candidate.offset, e.cur, coffset0, e.maxMatchOff))
enc_fast.go#L429: t = candidate2.offset - e.cur
enc_fast.go#L498: e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_fast.go#L554: v := e.table[i].offset
enc_fast.go#L560: e.table[i].offset = v
enc_fast.go#L627: e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_fast.go#L629: e.table[nextHash2] = tableEntry{offset: s + e.cur + 1, val: uint32(cv >> 8)}
enc_fast.go#L672: coffset0 := s - (candidate.offset - e.cur)
enc_fast.go#L673: coffset1 := s - (candidate2.offset - e.cur) + 1
enc_fast.go#L676: t = candidate.offset - e.cur
enc_fast.go#L688: t = candidate2.offset - e.cur
enc_fast.go#L758: e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_fast.go#L824: offset: i,
enc_fast.go#L828: offset: i + 1,
 |
The pages are generated with Golds v0.8.4. (GOOS=linux GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @zigo_101 (reachable from the left QR code) to get the latest news of Golds. |